Browsing by Subject "Trees (mathematics)"

Now showing items 1-16 of 16

    • Article  

      Automated implementation of complex distributed algorithms specified in the IOA language 

      Georgiou, Chryssis; Lynch, N.; Mavrommatis, Panayiotis; Tauber, J. A. (2009)
      IOA is a formal language for describing Input/Output automata that serves both as a formal specification language and as a programming language (Garland et al. in http://theory.lcs.mit.edu/tds/ioa/manual.ps, 2004). The IOA ...
    • Conference Object  

      Bounds on max-product algorithms for multiple fault diagnosis in graphs with loops 

      Le, T.; Hadjicostis, Christoforos N. (Institute of Electrical and Electronics Engineers Inc., 2007)
      In this paper, we analyze the performance of algorithms that use belief propagation max-product iterations to solve the generalized multiple fault diagnosis (GMFD) problem. The GMFD problem is described by a bipartite ...
    • Conference Object  

      Convergence of belief propagation algorithms on binary pairwise Gibbs random fields 

      Le, T.; Hadjicostis, Christoforos N. (2011)
      In this paper, we study the convergence of belief propagation algorithms (BPAs) on binary pairwise Gibbs random fields (BP-GRFs). Exploiting the equivalence of BPA on the graph associated with BP-GRF and the corresponding ...
    • Article  

      Distributed Calculation of Edge-Disjoint Spanning Trees for Robustifying Distributed Algorithms against Man-in-the-Middle Attacks 

      Oliva, G.; Cioaba, S.; Hadjicostis, Christoforos N. (2017)
      In this paper we provide a distributed methodology to allow a network of agents, tasked to execute a distributed algorithm, to overcome Man-in-the-middle attacks that aim at steering the result of the algorithm towards ...
    • Article  

      Efficient bufferless packet switching on trees and leveled networks 

      Busch, Costas; Magdon-Ismail, M.; Mavronicolas, Marios (2007)
      In bufferless networks the packets cannot be buffered while they are in transit
    • Article  

      A graph-theoretic network security game 

      Mavronicolas, Marios; Lesta, Vicky Papadopoulou; Philippou, Anna; Spirakis, Paul G. (2008)
      Consider a network vulnerable to viral infection, where the security software can guarantee safety only to a limited part of it. We model this practical network scenario as a non-cooperative multi-player game on a graph, ...
    • Article  

      Initial experiences porting a bioinformatics application to a graphics processor 

      Charalambous, Maria; Trancoso, Pedro; Stamatakis, A. (2005)
      Bioinformatics applications are one of the most relevant and compute-demanding applications today. While normally these applications are executed on clusters or dedicated parallel systems, in this work we explore the use ...
    • Conference Object  

      Marginal analysis on binary pairwise Gibbs random fields 

      Le, T.; Hadjicostis, Christoforos N. (2011)
      In this paper, we study marginal problems for a class of binary pairwise Gibbs random fields (BPW-GRFs). Given a BPW-GRF associated with a family of binary positive pairwise potentials, finding the exact marginal for each ...
    • Conference Object  

      The micropulse framework for adaptive waking windows in sensor networks 

      Zeinalipour-Yazdi, Constantinos D.; Andreou, Panayiotis G.; Chrysanthis, Panos K.; Samaras, George S.; Pitsillides, Andreas (2007)
      In this paper we present MicroPulse, a novel framework for adapting the waking window of a sensing device S based on the data workload incurred by a query Q. Assuming a typical tree-based aggregation scenario, the waking ...
    • Conference Object  

      Minimum-hot-spot query trees for wireless sensor networks 

      Chatzimilioudis, Georgios; Zeinalipour-Yazdi, Constantinos D.; Gunopulos, Dimitrios (2010)
      We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optimally balanced communication tree with minimum ...
    • Conference Object  

      Multi-objective query optimization in smartphone social networks 

      Konstantinidis, Andreas; Zeinalipour-Yazdi, Constantinos D.; Andreou, Panayiotis G.; Samaras, George S. (2011)
      The bulk of social network applications for smart phones (e.g., Twitter, Face book, Foursquare, etc.) currently rely on centralized or cloud-like architectures in order to carry out their data sharing and searching tasks. ...
    • Article  

      On the complexity of parallelizing sequential circuits using the parallel-prefix method 

      Hadjicostis, Christoforos N. (2001)
      The parallel-prefix method uses a tree of identical processing nodes to calculate in parallel, the state and output response of a finite-state machine (FSM) to a finite-length input sequence. Traditionally, each computing ...
    • Article  

      Optimized query routing trees for wireless sensor networks 

      Andreou, Panayiotis G.; Zeinalipour-Yazdi, Constantinos D.; Pamboris, Andreas; Chrysanthis, Panos K.; Samaras, George S. (2011)
      In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be ...
    • Conference Object  

      Performance analysis of sum-product algorithms for multiple fault diagnosis applications 

      Le, T.; Tatikonda, S.; Hadjicostis, Christoforos N. (2010)
      In this paper, we study the application of sum-product algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic ...
    • Conference Object  

      Shadow volume BSP trees for computation of shadows in dynamic scenes 

      Chrysanthou, Yiorgos L.; Slater, Mel (ACM, 1995)
      This paper presents an algorithm for shadow calculation in dynamic polyhedral scenes illuminated by point light sources. It is based on a modification of Shadow Volume Binary Space Partition trees, to allow these be ...
    • Conference Object  

      View volume culling using a probabilistic caching scheme 

      Slater, Mel; Chrysanthou, Yiorgos L. (ACM, 1997)
      This paper a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the view volume. Frame-to-frame coherence implies that the ...